/*
 https://leetcode.cn/problems/search-insert-position/
 35.搜索插入位置
 简单 欧琳琳 2024.11.20
 数组 二分查找
 */


class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int left=0;
        int right=nums.size()-1;
        while(left<=right)
        {
            int mid=left+(right-left)/2;
            if(target>nums[mid])
            {
                left=mid+1;
            }
            else if(target<nums[mid])
            {
                right=mid-1;
            }
            else
            {
                return mid;
            }
        }
        return left;
    }
};